Erratum: "bankruptcy Rules and Coalitional Manipulation"

نویسنده

  • Juan D. Moreno-Ternero
چکیده

In this paper, we study the immunity of bankruptcy rules to manipulation via merging or splitting agents’ claims. We focus on the TAL-family of bankruptcy rules (MorenoTernero & Villar, 2006), a one-parameter family encompassing three classical rules: the Talmud (T ) rule, the constrained equal-awards (A) rule and the constrained equal-losses (L) rule. We show that all rules within the TAL-family are partially non-manipulable and identify the domain of problems where each rule is either non-manipulable by merging or non-manipulable by splitting. We also show that they can be ranked in terms of their relative non-manipulability, according to the parameter that generates the family.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A coalitional procedure leading to a family of bankruptcy rules

We provide a general coalitional procedure that characterizes a family of rules for bankruptcy problems inspired by the Talmud.

متن کامل

Coalitional Manipulations and Generalized Proportional Rules∗

In a unified framework of allocation problems with at least three entities (or agents), we show that “generalized proportional rules” are the only rules that are robust to coalitional manipulations. We characterize proportional rules imposing in addition efficiency, dummy, and nonnegativity. Coalitional manipulations are considered both in the environment without any restriction on coalition fo...

متن کامل

Coalitional Manipulation on Communication Network

In an abstract model of division problems, we study division rules that are not manipulable through a reallocation of individual characteristic vectors within a coalition (e.g. reallocation of claims in bankruptcy problems). A coalition can be formed under a given communication network, a (non-directed) graph, if members of this coalition are connected on the graph. We offer a characterization ...

متن کامل

Manipulation under voting rule uncertainty

An important research topic in the field of computational social choice is the complexity of various forms of dishonest behavior, such as manipulation, control, and bribery. While much of the work on this topic assumes that the cheating party has full information about the election, recently there have been a number of attempts to gauge the complexity of non-truthful behavior under uncertainty ...

متن کامل

Manipulation Under Voting Rule Uncertainty1

An important research topic in the field of computational social choice is the complexity of various forms of dishonest behavior, such as manipulation, control, and bribery. While much of the work on this topic assumes that the cheating party has full information about the election, recently there have been a number of attempts to gauge the complexity of non-truthful behavior under uncertainty ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IGTR

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2007